Descendants and Origins in Term Rewriting
نویسندگان
چکیده
In this paper we treat various aspects of a notion that is central in term rewriting namely that of descendants or residuals We address both rst order term rewriting and calculus their nitary as well as their in nitary variants A recurrent theme is the Parallel Moves Lemma Next to the classical notion of descendant we introduce an extended version known as origin tracking Origin tracking has many applications Here it is employed to give new proofs of three classical theorems the Genericity Lemma in calculus the theorem of Huet and L evy on needed reduc tions in rst order term rewriting and Berry s Sequentiality Theorem in in nitary calculus Note This article is based on a lecture given by Jan Willem Klop at RTA held in Tsukuba Japan
منابع مشابه
Origin Tracking
In the framework of conditional, not necessarily orthogonal, term rewriting systems, we introduce the notion of an origin. Origins are relations between subterms of intermediate terms which occur during rewriting, and subterms of the initial term. Origin tracking is a method for incrementally computing origins during rewriting. Origins are a generalization of the well-known concept of residuals...
متن کاملDecidable Approximations of Sets of Descendants and Sets of Normal Forms
We present here decidable approximations of sets of descendants and sets of normal forms of Term Rewriting Systems, based on speciic tree automata techniques. In the context of rewriting logic, a Term Rewriting System is a program, and a normal form is a result of the program. Thus, approximations of sets of descendants and sets of normal forms provide tools for analysing a few properties of pr...
متن کاملReasoning about Term Rewriting in Kleene Categories with Converse
This paper shows that “root-only” rewrite relations with respect to term rewriting systems can be expressed using Kleene star operations in a gs-monoidal Kleene category with converse. In our framework, we can analyze some properties of term rewriting systems by computing rewrite descendants of tree languages. As an application, we consider an infinite state model-checking problem given by a te...
متن کاملReachability Analysis of Term Rewriting Systems with Timbuk -extended Version - Reachability Analysis of Term Rewriting Systems with Timbuk -extended Version
We present Timbuk a tree automata library which implements usual operations on tree automata as well as a completion algorithm used to compute an over-approximation of the set of descendants R (E) for a regular set E and a term rewriting system R, possibly non linear and non terminating. On several examples of term rewriting systems representing programs and systems to verify, we show how to us...
متن کاملOver-Approximating Terms Reachable by Context-Sensitive Rewriting
For any left-linear context-sensitive term rewrite system and any regular language of ground terms I, we build a finite tree automaton that recognizes a superset of the descendants of I, i.e. of the terms reachable from I by context-sensitive rewriting.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 159 شماره
صفحات -
تاریخ انتشار 2000